The polyhedral tree complex
نویسندگان
چکیده
The tree complex is a simplicial defined in recent work of Belk, Lanier, Margalit, and Winarski with applications to mapping class groups dynamics. This article introduces connection between this setting the convex polytopes known as associahedra cyclohedra. Specifically, we describe characterization these using planar embeddings trees show that barycentric subdivision polyhedral cell for which cells are products cyclohedra.Mathematics Subject Classifications: 05C05, 05C10, 20F65, 52B11Keywords: Associahedra, cyclohedra, trees,
منابع مشابه
Polyhedral Covers of Tree Space
The phylogenetic tree space, introduced by Billera, Holmes, and Vogtmann, is a cone over a simplicial complex. In this short article, we construct this complex from local gluings of classical polytopes, the associahedron and the permutohedron. Its homotopy is also reinterpreted and calculated based on polytope data.
متن کاملPolyhedral Approaches for the Steiner Tree Problem on Graphs
5 Branch-and-cut Approach for Solving STP on Graphs 15 5.1 Preprocessing STP on a Graph . . . . . . . . . . . . . . . . . . . . . 16 5.1.1 Degree Tests for STP on Graphs . . . . . . . . . . . . . . . . 16 5.1.2 Terminal Distance Test . . . . . . . . . . . . . . . . . . . . . 17 5.1.3 Special Distance Test . . . . . . . . . . . . . . . . . . . . . . 17 5.2 Initializing to Solve STP . . . . . . ....
متن کاملPolyhedral Properties of the K -median Problem on a Tree
The polyhedral structure of the K-median problem on a tree is examined. Even for very small connected graphs, we show that additional constraints are needed to describe the integer polytope. A complete description is given of those trees for which an optimal integer LP solution is guaranteed to exist. We present a new and simpler demonstration that an LP characterization of the 2-median problem...
متن کاملThe generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
This article presents a branch-and-cut algorithm for the Generalized Minimum Spanning Tree Problem (GMSTP). Given an undirected graph whose vertex set is partitioned into clusters, the GMSTP consists of determining a minimum cost tree including exactly one vertex per cluster. Applications of the GMSTP are encountered in telecommunications. An integer linear programming formulation is presented ...
متن کاملA polyhedral study of the diameter constrained minimum spanning tree problem∗
This paper provides a study of integer linear programming formulations for the diameter con-strained spanning tree problem (DMSTP) in the natural space of edge design variables. Afterpresenting a straightforward model based on the well known jump inequalities a new stronger familyof circular-jump inequalities is introduced. These inequalities are further generalized in two ways:...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorial theory
سال: 2022
ISSN: ['2766-1334']
DOI: https://doi.org/10.5070/c62359156